Maximizing Maximal Angles for Plane Straight-Line Graphs
نویسندگان
چکیده
Let G = (S,E) be a plane straight line graph on a finite point set S ⊂ R in general position. For a point p ∈ S let the maximum incident angle of p in G be the maximum angle between any two edges of G that appear consecutively in the circular order of the edges incident to p. A plane straight line graph is called φopen if each vertex has an incident angle of size at least φ. In this paper we study the following type of question: What is the maximum angle φ such that for any finite set S ⊂ R of points in general position we can find a graph from a certain class of graphs on S that is φ-open? In particular, we consider the classes of triangulations, spanning trees, and paths on S and give tight bounds in all but one cases.
منابع مشابه
On Drawing Planar Angle Graphs
Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not aesthetically nice. Our goal is to resolve these problems by a beautifier. We consider the angles of planar straight line drawings. In a first phase we compute maximal angles by repeatedly solving a linear ...
متن کاملCrossing Angles of Geometric Graphs
We study the crossing angles of geometric graphs in the plane. We introduce the crossing angle number of a graph G, denoted can(G), which is the minimum number of angles between crossing edges in a straight-line drawing of G. We show that an n-vertex graph G with can(G) = O(1) has O(n) edges, but there are graphs G with bounded degree and arbitrarily large can(G). We also initiate the study of ...
متن کاملBounding the Number of Plane Graphs
We investigate the number of plane geometric, i.e., straight-line, graphs, a set S of n points in the plane admits. We show that the number of plane graphs is minimized when S is in convex position, and that the same result holds for several relevant subfamilies. In addition we construct a new extremal configuration, the so-called double zig-zag chain. Most noteworthy this example bears Θ∗( √ 7...
متن کاملA Note on Minimum-Segment Drawings of Planar Graphs
A straight-line drawing of a planar graph G is a planar drawing of G, where each vertex is mapped to a point on the Euclidean plane and each edge is drawn as a straight line segment. A segment in a straight-line drawing is a maximal set of edges that form a straight line segment. A minimum-segment drawing of G is a straightline drawing of G, where the number of segments is the minimum among all...
متن کاملGray Code Enumeration of Plane Straight-Line Graphs
We develop Gray code enumeration schemes for geometric straight-line graphs in the plane. The considered graph classes include plane graphs, connected plane graphs, and plane spanning trees. Previous results were restricted to the case where the underlying vertex set is in convex position.
متن کامل